Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares
نویسندگان
چکیده
In this paper, we propose a new notion of rep-cube which is a net of a cube, and it can be divided into some polygons such that each of them can be folded to a cube. This notion is inspired by polyomino and rep-tile; both are introduced by Solomon W. Golomb, and well investigated in the recreational mathematics society. We prove that there are infintely many distinct rep-cubes. We also extend this notion to doubly covered squares and regular tetrahedra.
منابع مشابه
Adaptive cube tessellation for topologically correct isosurfaces
Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...
متن کاملCentered Cubic Lattice Method Comparison
The Centered Cubic Lattice method is used for an iso-surface extraction. This paper focuses on its comparison with other fundamental methods (Marching Cubes, Marching Tetrahedra) that are also used to extract an iso-surface from regular volume data. Iso-surfaces that are generated using above mentioned methods and mathematical data are compared due to area and volume approximation. The Hausdorf...
متن کاملRegularised marching tetrahedra: improved iso-surface extraction
Marching cubes is a simple and popular method for extracting iso-surfaces from implicit functions or discrete three-dimensional (3-D) data. However, it does not guarantee the surface to be topologically consistent with the data, and it creates triangulations which contain many triangles of poor aspect ratio. Marching tetrahedra is a variation of marching cubes, which overcomes this topological ...
متن کاملRep-cubes: Unfolding and Dissection of Cubes
Last year, a new notion of rep-cube was proposed. A rep-cube is a polyomino that is a net of a cube, and it can be divided into some polyominoes such that each of them can be folded to a cube. This notion was inspired by the notions of polyomino and rep-tile, which were introduced by Solomon W. Golomb. It was proved that there are infinitely many distinct rep-cubes. In this paper, we investigat...
متن کاملBetween the cubes
The Marching Cubes (MC) algorithm is commonly used for polygonising implicit surfaces, but generates an excessively large number of polygons. We present an algorithm to decimate the number of polygons within the framework of the MC algorithm, before creating a large number of polygons by using the octree data-structure, while preserving the correct topology obtained by using tetrahedra instead ...
متن کامل